Auto-Mobiles: Optimised Message-Passing
نویسنده
چکیده
Some message-passing concurrent systems, such as occam 2, prohibit aliasing of data objects. Communicated data must thus be copied, which can be timeintensive for large data packets such as video frames. We introduce automatic mobility, a compiler optimisation that performs communications by reference and deduces when these communications can be performed without copying. We discuss bounds for speed-up and memory use, and benchmark the automatic mobility optimisation. We show that in the best case it can transform an operation from being linear with respect to packet size into constant-time.
منابع مشابه
Search and Tracking Algorithms for Rapidly Moving Mobiles Search and Tracking Algorithms for Rapidly Moving Mobiles
With the advent of wireless technology and laptops, mobility is an important area of research. A fundamental problem in this area is the delivery of messages to a moving mobile. Current solutions, work correctly only for slowly moving nodes that stay in one location long enough for tracking to stabilize. In this paper we consider the problem of message delivery to rapidly moving mobile units. W...
متن کاملA High-Performance PVM for Alpha Clusters
This paper describes a new implementation of the PVM message-passing system that is optimised for operation on multiprocessor and clustered Digital Alpha UNIX machines, while still allowing interoperabil-ity with other implementations of PVM and providing a fully-compatible PVM API. Initial performance results are detailed which show that hitherto supercomputer-class message-passing performance...
متن کاملResource-Efficient, Hierarchical Auto-Tuning of a Hybrid Lattice Boltzmann Computation on the Cray XT4
We apply auto-tuning to a hybrid MPI-pthreads lattice Boltzmann computation running on the Cray XT4 at National Energy Research Scientific Computing Center (NERSC). Previous work showed that multicorespecific auto-tuning can improve the performance of lattice Boltzmann magnetohydrodynamics (LBMHD) by a factor of 4× when running on dualand quad-core Opteron dual-socket SMPs. We extend these stud...
متن کاملUsing Bisimulation Proof Techniques for the Analysis of Distributed Algorithms
We illustrate the use of recently developped proof techniques for weak bisimulation by analysing a generic framework for the definition of distributed abstract machines based on a message-passing implementation. We first define this framework, and then focus on the algorithm which is used to route messages asynchronously to their destination. A first version of this algorithm can be analysed us...
متن کاملAuto-CFD: Efficiently Parallelizing CFD Applications on Clusters
Computational Fluid Dynamics (CFD) applications are highly demanding for parallel computing. Many such applications have been shifted from expensive MPP boxes to cost-effective clusters. Auto-CFD is a pre-compiler which transforms Fortran CFD sequential programs to efficient message-passing parallel programs running on clusters. Our work has the following three unique contributions. First, this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009